منابع مشابه
On Canonical Constructions. Ii.
In the second paper in this series [2; 3], it was demonstrated that under suitable topological conditions on a space 5 (which are in particular always satisfied for a manifold), the problem of reconstructing S from its group G of homeomorphism onto itself may be reduced to the problem of reconstructing the points of 5 from C7. If 5 can be reconstructed then every automorphism of G is inner, and...
متن کاملON CANONICAL CONSTRUCTIONS. Ill
In the first paper in this series a structure S was called canonically reconstructible from a structure T provided 5 was canonically isomorphic to a structure T' derived from T. The principle proposition of the paper was the scholium which asserted: If a structure 5 contains a substructure T and if S is canonically reconstructible from T, then every automorphism of T may be extended uniquely to...
متن کاملAn Analogical Approach to Learning Constraints on Non-canonical Constructions
Non-canonical constructions differ from canonical structures in that they carry extra pragmatic meaning relating their arguments to the current discourse. One important question is how language users learn the pragmatic relationships that govern these variations. This paper proposes that these relationships can be learned through analogical generalization over first explicit and then inferentia...
متن کاملCoalgebraic constructions of canonical nondeterministic automata
For each regular language L we describe a family of canonical nondeterministic acceptors (nfas). Their construction follows a uniform recipe: build the minimal dfa for L in a locally finite variety V, and apply an equivalence between the category of finite V-algebras and a suitable category of finite structured sets and relations. By instantiating this to different varieties, we recover three w...
متن کاملCanonical derivatives, partial derivatives and finite automaton constructions
Let E be a regular expression. Our aim is to establish a theoretical relation between two well-known automata recognizing the language of E, namely the position automaton PE constructed by Glushkov or McNaughton and Yamada, and the equation automaton EE constructed by Mirkin or Antimirov. We define the notion of c-derivative (for canonical derivative) of a regular expression E and show that if ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the American Mathematical Society
سال: 1956
ISSN: 0002-9939
DOI: 10.2307/2033348